Hash Algorithms: a Design for Parallel Calculations
نویسنده
چکیده
It has been shown that the standardized hash-algorithms SHA-1, RIPEMD-160, MD-5 and others of that type have substantial performance restrictions due to their sequential structure. Modified variants of hash-algorithms are suggested which make it possible to independently calculate partial hashsignatures while maintaining the irreversibility level of the standard algorithms. These variants give new opportunities for wide parallel calculation of hash-signatures. In fact, applying the suggested modified algorithms remove the performance restrictions affiliated with the calculation an information message’s hash-signatures. In practice, the hash-algorithms suggested may be used for integrity and authentication of information messages in computer network.
منابع مشابه
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that combines the bisection technique with a fast root-finding procedure to obtain each eigenvalue. We design a parallel algorithm that applies a static distribution of the calculations among processors and three algorithm...
متن کاملThe Multidisciplinary Design Optimization of a Reentry Vehicle Using Parallel Genetic Algorithms
The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...
متن کاملPerfect Hashing for Strings: Formalization and Algorithms
Numbers and strings are two objects manipulated by most programs. Hashing has been well-studied for numbers and it has been eeective in practice. In contrast, basic hashing issues for strings remain largely unex-plored. In this paper, we identify and formulate the core hashing problem for strings that we call substring hashing. Our main technical results are highly eecient sequential/parallel (...
متن کاملMulti-Hash: A Family of Cryptographic Hash Algorithm Extensions white paper
The paper proposes extensions to cryptographic hash algorithms, such as SHA, that add support for parallel processing of a single message. The goal is to take concepts from tree hashing and apply the parallel performance benefits to a single data buffer in a single threaded core of a modern microprocessor. Additionally, a method for applying the Multi-Hash concept to HMAC is suggested. The pape...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کامل